Combinatorial optimization

Results: 1158



#Item
991Approximating NP-hard Problems Efficient Algorithms and their Limits Prasad Raghavendra  A dissertation submitted in partial fulfillment

Approximating NP-hard Problems Efficient Algorithms and their Limits Prasad Raghavendra A dissertation submitted in partial fulfillment

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2009-10-30 11:58:51
992Counting and Sampling Minimum Cuts in Genus g Graphs Erin W. Chambers∗ Kyle Fox†  Amir Nayyeri‡

Counting and Sampling Minimum Cuts in Genus g Graphs Erin W. Chambers∗ Kyle Fox† Amir Nayyeri‡

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2013-09-03 13:18:47
993Better Guarantees for Sparsest Cut Clustering  Maria-Florina Balcan Microsoft Research, New England One Memorial Drive, Cambridge, MA [removed]

Better Guarantees for Sparsest Cut Clustering Maria-Florina Balcan Microsoft Research, New England One Memorial Drive, Cambridge, MA [removed]

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2009-05-22 14:29:08
994Angelic Hierarchical Planning: Optimal and Online Algorithms Bhaskara Marthi Stuart Russell  Jason Wolfe∗

Angelic Hierarchical Planning: Optimal and Online Algorithms Bhaskara Marthi Stuart Russell Jason Wolfe∗

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2008-09-04 20:26:09
995Approximability of Constraint Satisfaction Problems Venkatesan Guruswami Carnegie Mellon University October 2009

Approximability of Constraint Satisfaction Problems Venkatesan Guruswami Carnegie Mellon University October 2009

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2009-11-30 17:57:22
996Every 2-CSP allows nontrivial approximation Johan H˚ astad Royal Institute of Technology

Every 2-CSP allows nontrivial approximation Johan H˚ astad Royal Institute of Technology

Add to Reading List

Source URL: www.nada.kth.se

Language: English - Date: 2005-06-22 08:43:27
997CSPs Classical results Semi-Definite programming Inapproximability results Classification Final words

CSPs Classical results Semi-Definite programming Inapproximability results Classification Final words

Add to Reading List

Source URL: www.nada.kth.se

Language: English - Date: 2007-09-24 02:56:24
998CSPs Classical results Semi-Definite programming Inapproximability results Classification Unique games

CSPs Classical results Semi-Definite programming Inapproximability results Classification Unique games

Add to Reading List

Source URL: www.nada.kth.se

Language: English - Date: 2007-09-24 02:48:52
999R Foundations and Trends
 in Machine Learning

R Foundations and Trends in Machine Learning

Add to Reading List

Source URL: www.di.ens.fr

Language: English - Date: 2013-10-07 09:14:41
1000A Graph-Theoretic Approach to Webpage Segmentation Deepayan Chakrabarti

A Graph-Theoretic Approach to Webpage Segmentation Deepayan Chakrabarti

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2008-02-26 18:09:08